CS278: Computational Complexity Spring 2001 Luca Trevisan These are scribed notes from a graduate course on Computational Complexity offered at the University of California at Berkeley in the Spring ofThe notes h

Source URL: www.eecs.berkeley.edu

Property Testing: A Learning Theory Perspective Dana Ron∗ School of EE Tel-Aviv University Ramat Aviv, Israel

Source URL: www.eng.tau.ac.il

• Machine learning
• Computational complexity theory
• Theoretical computer science
• Applied mathematics
• Learning
• Models of computation
• Property testing
• Decision tree model
• Sample complexity
• PP
• Probability distribution
• Time complexity

December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Source URL: www.jsbi.org

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Clique
• Subgraph isomorphism problem
• Matching
• Protein kinase
• Protein
• Root-mean-square deviation of atomic positions

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre de Bruxelles Brussels, Belgium

Source URL: www.strc.ch

• Computational complexity theory
• Ant colony optimization algorithms
• Mathematics
• Ant
• Systems science
• Travelling salesman problem
• Argentine ant
• Stigmergy
• Pheromone
• Dalle Molle Institute for Artificial Intelligence Research
• Artificial ants
• Swarm intelligence

Solution Quality and Efficiency in Discrete Optimization 2 Scientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Mathematics
• Theory of computation
• Operations research
• NP-complete problems
• Mathematical optimization
• Convex optimization
• Travelling salesman problem
• Approximation algorithm
• Optimization problem
• Algorithm
• Genetic algorithm

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Source URL: www.usenix.org

• Complexity classes
• Circuit complexity
• Computational complexity theory
• Zero-knowledge proof
• Non-interactive zero-knowledge proof
• SM-62 Snark
• XTR
• NC
• NP
• Proof of knowledge
• Computer
• ZK

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

Homework 3 Computational Complexity April 4, 2014 Due on Monday, April 28. mention your collaborators.

Source URL: www.cs.nyu.edu

Conference on Computational Complexity Conference Committee Charter I. Purpose of the Conference on Computational Complexity The objective of the Conference on Computational Complexity is to foster research in computatio

Source URL: facweb.cs.depaul.edu

EN : Computational Genomics  Prof. Ben Langmead    Before starting this class, you should be comfortable with (a) data structures and algorithms, (b)  complexity of algorithms, and (

Source URL: www.cs.jhu.edu